Skip to content

Directed Graph implementation with a minimum operation set #4

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom
Open
wants to merge 10 commits into
base: master
Choose a base branch
from
Open

Directed Graph implementation with a minimum operation set #4

wants to merge 10 commits into from

Conversation

Dspade0
Copy link

@Dspade0 Dspade0 commented Mar 14, 2017 •
edited
Loading

This directed graph implementation contains such operation set:

  • vertex adding;
  • connecting/disconnecting vertices with weighted edges;
  • checking for vertices/edges availability and its weights;
  • transposing graph;
  • computing the shortest paths from a single source vertex;
  • topological sort.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
1 participant
@Dspade0